# all-zero codeword

- кодовое слово из одних нулей

*English-Russian dictionary of telecommunications and their abbreviations.
A.V. Alexandrov..
2004.*

### Смотреть что такое "all-zero codeword" в других словарях:

**Cyclic code**— In coding theory, cyclic codes are linear block error correcting codes that have convenient algebraic structures for efficient error detection and correction. Contents 1 Definition 2 Algebraic structure 3 Examples … Wikipedia**Coding theory approaches to nucleic acid design**— DNA code construction refers to the application of coding theory to the design of nucleic acid systems for the field of DNA–based computation. Contents 1 Introduction 2 Definitions 2.1 Property U 2 … Wikipedia**Reed–Muller code**— Reed Muller codes are a family of linear error correcting codes used in communications. They are named after their discoverers, Irving S. Reed and D. E. Muller. Muller discovered the codes, and Reed proposed the majority logic decoding for the… … Wikipedia**Polynomial code**— In coding theory, a polynomial code is a type of linear code whose set of valid code words consists of those polynomials (usually of some fixed length) that are divisible by a given fixed polynomial (of shorter length, called the generator… … Wikipedia**Mathematics of CRC**— Cyclic Redundancy Check (CRC) is based on division in the ring of polynomials over the finite field GF(2) (the integers modulo 2), that is, the set of polynomials where each coefficient is either zero or one, and arithmetic operations wrap around … Wikipedia**Huffman coding**— Huffman tree generated from the exact frequencies of the text this is an example of a huffman tree . The frequencies and codes of each character are below. Encoding the sentence with this code requires 135 bits, as opposed of 288 bits if 36… … Wikipedia**Reed–Solomon error correction**— Reed Solomon error correction is an error correcting code that works by oversampling a polynomial constructed from the data. The polynomial is evaluated at several points, and these values are sent or recorded. Sampling the polynomial more often… … Wikipedia**Cyclic redundancy check**— A cyclic redundancy check (CRC) is an error detecting code designed to detect accidental changes to raw computer data, and is commonly used in digital networks and storage devices such as hard disk drives. Blocks of data entering these systems… … Wikipedia**Low-density parity-check code**— In information theory, a low density parity check code (LDPC code) is an error correcting code, a method of transmitting a message over a noisy transmission channel. [David J.C. MacKay (2003) Information theory, inference and learning algorithms … Wikipedia**Serial digital interface**— (SDI) refers to a family of video interfaces standardized by SMPTE. [cite book | title = Digital Video and HDTV | author = Charles A. Poynton | publisher = Morgan Kaufmann | year = 2003 | isbn = 1558607927 | url = http://books.google.com/books?id … Wikipedia**Canonical Huffman code**— A canonical Huffman code is a particular type of Huffman code which has the property that it can be very compactly described.Data compressors generally work in one of two ways. Either the decompressor can infer what codebook the compressor has… … Wikipedia